A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
نویسندگان
چکیده
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with different qualifications and availabilities should be assigned to a set of games already scheduled. We extend and improve a previous three-phase approach for this problem, based on a constructive heuristic, a repair heuristic to make the initial solutions feasible, and an ILS improvement heuristic. We propose a new constructive algorithm based on a greedy criterion to build initial solutions. Furthermore, we develop a hybridization strategy in which a mixed integer programming exact algorithm replaces the original neighborhood-based local search within the ILS heuristic. Computational experiments are performed for large realistic instances. The use of time-to-target-solution-value plots is emphasized in the evaluation of the numerical results, illustrating the efficiency and the robustness of the new approach. The proposed hybridization of MIP with local search can be extended to other metaheuristics and applications, opening a new research avenue to more robust algorithms.
منابع مشابه
Hybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملAn Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem
In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملA heuristic method for combined optimization of layout design and cluster configuration in continuous productions
Facility layout problems have been generally solved either hierarchically or integrated into other phases of plant design. In this paper, a hybrid method is introduced so that clustering and facilities layout can be simultaneously optimized. Each cluster is formed by a group of connected facilities and selection of the most appropriate cluster configuration is aimed. Since exact method by MIP i...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کامل